Coupling Iterative Subsystem Solvers
نویسنده
چکیده
We sketch an algorithmic framework to integrate (iterative) solvers of subsystems of a large nonlinear system into a joint iterative solution process.
منابع مشابه
Convergence acceleration method of large-scale parallel iterative solvers for heterogeneous properties
In large-scale scienti c computing, linear sparse solver is one of the most time-consuming process. In GeoFEM, various types of preconditioned iterative method is implemented on massively parallel computers. It has been well-known that ILU(0) factorization is very e ective preconditioning method for iterative solver. But it's also well-known that this method requires global data dependency and ...
متن کاملRegularized HSS Iteration Method for Saddle - Point Linear Systems
We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of large, sparse linear systems in saddle-point form. These methods can be used as stationary iterative solvers or as preconditioners for Krylov subspace methods. We establish unconditional convergence of the stationary iterations and we examine the spectral properties of the corresponding precondi...
متن کاملRegularized HSS iteration methods for saddle-point linear systems
We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of large, sparse linear systems in saddle-point form. These methods can be used as stationary iterative solvers or as preconditioners for Krylov subspacemethods.We establish unconditional convergence of the stationary iterations and we examine the spectral properties of the corresponding preconditi...
متن کاملFast solvers with block-diagonal preconditioners for linear FEM-BEM coupling
The purpose of this paper is to present optimal preconditioned iterative methods to solve indefinite linear systems of equations arising from symmetric coupling of finite elements and boundary elements [14]. This is a block-diagonal preconditioner together with a conjugate residual method (PCR) and a preconditioned inner-outer iteration (PIO). We prove the efficiency of these methods by showing...
متن کاملConvergence of iterative Solvers for non-Linear Step-and-Flash imprint lithography Simulations
The paper presents the analysis of the iterative solvers utilized to solve the non-linear problem of Step-and-Flash Imprint Lithography (SFIL) a modern patterning process. The simulations consists in solving molecular statics problem for the polymer network, with quadratic potentials. The model distinguishes the strong interparticle interactions between particles forming a polymer network, and ...
متن کامل